package com.codeforces;

import java.util.*;

public class C1447 {
    Scanner in = new Scanner(System.in);

    public static void main(String[] args) {
        C1447 s = new C1447();
        s.solve();
    }

    private void solve() {
        int t = in.nextInt();
        while (t-->0){
            int n = in.nextInt();
            long w=  in.nextLong();
            int[][] arr = new int[n][2];
            long sum = 0;
            for(int i = 0;i < n;i++){
                int temp = in.nextInt();
                sum += temp;
                arr[i][0] = temp;
                arr[i][1] = i;
            }
            Arrays.sort(arr, Comparator.comparingInt(o -> o[0]));
            int left = 0,right = n-1;
            long low = (w + 1) / 2;
            long curr = 0;
            for(int i = n - 1;i >= 0;i--){
                if(curr + arr[i][0] <= w){
                    curr += arr[i][0];
                }
            }
            if(curr >= low && curr <= w){
                System.out.println((right - left + 1));
                for(int i = left ;i <= right ;i++){
                    System.out.print((arr[i][1] + 1)+ " ");
                }
                System.out.println();
            }else{
                System.out.println(-1);
            }
        }

    }
}
